A Goppa-like bound on the trellis state complexity of algebraic-geometric codes
نویسندگان
چکیده
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C) of C is upper bounded by w(C) := min(k, n− k). In this paper we point out some new lower bounds for s(C). In particular, if C is an Algebraic Geometric code, then s(C) ≥ w(C) − (g − a), where g is the genus of the underlying curve and a is the abundance of the code.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملOn Weierstrass semigroups and the redundancy of improved geometric Goppa codes
Improved geometric Goppa codes have a smaller redundancy and the same bound on the minimum as ordinary algebraic geometry codes. For an asymptotically good sequence of function fields we give a formula for the redundancy.
متن کاملA low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
Since the proof in 1982, by Tsfasman Vlăduţ and Zink of the existence of algebraic-geometric (AG) codes with asymptotic performance exceeding the Gilbert–Varshamov (G–V) bound, one of the challenges in coding theory has been to provide explicit constructions for these codes. In a major step forward during 1995–1996, Garcia and Stichtenoth (G–S) provided an explicit description of algebraic curv...
متن کاملOn GAG-Codes and Geometric Goppa Codes
We investigate a relation between generalized algebraic geometry codes and geometric Goppa codes. We also propose a decoding method for algebraic geometry codes.
متن کاملSystematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes
Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Griihner bases for modules gives a compact description and implementation of a systematic encoder. We present examples of algebraic-geometric Goppa codes that can be encoded by these methods, including the one-point Hermitian codes. Index TermsSystematic encoding, algebraic-geometr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2003